A sufficient condition for Hamilton cycles in bipartite tournaments
نویسندگان
چکیده
منابع مشابه
Two-Path Convexity and Bipartite Tournaments of Small Rank
We study two-path convexity in bipartite tournaments. For a bipartite tournament, we obtain both a necessary condition and a sufficient condition on the adjacency matrix for its rank to be two. We then investigate 4-cycles in bipartite tournaments of small rank. We show that every vertex in a bipartite tournament of rank two lies on a four cycle, and bipartite tournaments with a maximum number ...
متن کاملDetermining properties of a multipartite tournament from its lattice of convex subsets
The collection of convex subsets of a multipartite tournament T forms a lattice C(T ). Given a lattice structure for C(T ), we deduce properties of T . In particular, we find conditions under which we can detect clones in T . We also determine conditions on the lattice which will imply that T is bipartite, except for a few cases. We classify the ambiguous cases. Finally, we study a property of ...
متن کاملSpectral analogues of Erdős’ and Moon-Moser’s theorems on Hamilton cycles
In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper we present the spectral analogues of Erdős’ theorem and Moon-Moser’s theorem, respectively. Let Gk n be the ...
متن کاملOn the existence of specified cycles in bipartite tournaments
For two integers n ≥ 3 and 2 ≤ p ≤ n, we denote D(n, p) the digraph obtained from a directed n-cycle by changing the orientations of p − 1 consecutive arcs. In this paper, we show that a family of k-regular (k ≥ 3) bipartite tournament BT4k contains D(4k, p) for all 2 ≤ p ≤ 4k unless BT4k is isomorphic to a digraph D such that (1, 2, 3, ..., 4k, 1) is a Hamilton cycle and (4m+ i− 1, i) ∈ A(D) a...
متن کاملHamilton Decompositions of Regular Tournaments
We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each η > 0 every regular tournament G of sufficiently large order n contains at least (1/2− η)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tourname...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 38 شماره
صفحات -
تاریخ انتشار 2007